package java;

import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;

/**
 * @author:谢君臣
 * @Date:2021/7/31-15:59
 * @version:1.0
 * @function:
 */
public class testA {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(),k = in.nextInt();
        int i = 0;
        List<Integer> arr = new ArrayList<>();
        while (i++<n) arr.add(in.nextInt());
        List<node> nodes = new ArrayList<>();
        i = 0;
        while (i<=n-2){
            int val = arr.get(i+1)- arr.get(i);
            int x = arr.get(i),y = arr.get(i+1);
            node node = new node(val, x, y);
            nodes.add(node);
            i++;
        }
        nodes.sort(Comparator.comparing(node::getVal).reversed());
        int min = insert(nodes,k);
    }

    private static int insert(List<node> nodes, int k) {
        double ceil = Math.ceil(nodes.get(0).val / nodes.get(1).val);
        if (ceil>k) return k;
        else return (int) ceil;
    }
}

class node{
    int val;
    int i;
    int j;

    public node(int val, int i, int j) {
        this.val = val;
        this.i = i;
        this.j = j;
    }

    public int getVal() {
        return val;
    }

    public int getI() {
        return i;
    }

    public int getJ() {
        return j;
    }
}

